Steiner minimal trees on the union of two orthogonal rectangles

نویسندگان

  • R. S. Booth
  • J. F. Weng
چکیده

Suppose R is a union of two subsets Rl and R2 whose Steiner minimal trees SMT(R 1) and SMT(R2) are known. The decomposition question is when the Steiner minimal tree SMT(R) for R is just the union of two Steiner minimal trees on R 1 and R2 In this paper a special case studied, that R 1 =bcda, R2=defg are two non-overlapping rectangles with a common vertex d so that a,d,e lie on one line. We conclude that SMT(R) has only two possible structures. We also two sufficient conditions for the decomposition SMT(R 1 U R 2) SMT(R 1) U SMT(R2) , and prove that under suitable assumptions of randomness, the probability of such a decomposition is 0.9679.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars

Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...

متن کامل

On the configuration space of Steiner minimal trees

Among other results, we prove the following theorem about Steiner minimal trees in ddimensional Euclidean space: if two finite sets in R have unique and combinatorially equivalent Steiner minimal trees, then there is a homotopy between the two sets that maintains the uniqueness and the combinatorial structure of the Steiner minimal tree throughout the homotopy.

متن کامل

The Steiner Problem on Narrow and Wide Cones

Given a surface and n fixed points on the surface, the Steiner problem asks to find the minimal length path network in the surface connecting the n fixed points. The solution to a Steiner problem is called a Steiner minimal tree. The Steiner problem in the plane has been well studied, but until recently few results have been found for non-planar surfaces. In this paper we examine the Steiner pr...

متن کامل

Geometric conditions for Euclidean Steiner trees in ℜd

We present geometric conditions that can be used to restrict or eliminate candidate topologes for Euclidean Steiner minimal trees in , d ≥ 2. Our emphasis is on conditions that are not restricted to the planar case (d = 2). For trees with a Steiner topology we give restrictions on terminal-Steiner connections that are based on the Voronoi diagram associated with the set of terminal nodes. We th...

متن کامل

The histology of minigrafting of Persian walnut trees cv. chandler

Compared to other techniques of propagation, grafting is the most successful and feasible technique for asexual propagation of walnut plants. There is little information about graft union formation in walnut. Therefore, the objective of this study was to evaluate histological events during graft union formation in Juglans regia L. cv. Chandler scions when minigrafted on the one-year-old seedlin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 13  شماره 

صفحات  -

تاریخ انتشار 1996